Spectral bounds for the k-independence number of a graph
نویسندگان
چکیده
منابع مشابه
Spectral bounds for the k-independence number of a graph
In this paper, we obtain two spectral upper bounds for the k-independence number of a graph which is is the maximum size of a set of vertices at pairwise distance greater than k. We construct graphs that attain equality for our first bound and show that our second bound compares favorably to previous bounds on the k-independence number.
متن کاملBounds on the restrained Roman domination number of a graph
A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...
متن کاملNew Approach to the k-Independence Number of a Graph
Let G = (V,E) be a graph and k > 0 an integer. A k-independent set S ⊆ V is a set of vertices such that the maximum degree in the graph induced by S is at most k. With αk(G) we denote the maximum cardinality of a k-independent set of G. We prove that, for a graph G on n vertices and average degree d, αk(G) > k+1 ⌈d⌉+k+1n, improving the hitherto best general lower bound due to Caro and Tuza [Imp...
متن کاملBounds for the Co-PI index of a graph
In this paper, we present some inequalities for the Co-PI index involving the some topological indices, the number of vertices and edges, and the maximum degree. After that, we give a result for trees. In addition, we give some inequalities for the largest eigenvalue of the Co-PI matrix of G.
متن کاملSpectral Densest Subgraph and Independence Number of a Graph
In this paper, we study spectral versions of the densest subgraph problem and the largest independence subset problem. In the first part, we give an algorithm for identifying small subgraphs with large spectral radius. We also prove a Hoffman-type ratio bound for the order of an induced subgraph whose spectral radius is bounded from above.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2016
ISSN: 0024-3795
DOI: 10.1016/j.laa.2016.08.024